Tafel Musik: Formatting algorithm of tables
نویسندگان
چکیده
منابع مشابه
An algorithm for Secure Formatting of memory
Flash memories find wide use in storing data in any application. Data deletion in flash memories involves making the data unreliable on the device. As contents get deleted in the flash memory, time is consumed in deleting the data on the flash permanently. This paper proposes a method to make the contents of the deleted blocks in the flash memory unreliable. The proposed method makes data unrel...
متن کاملFormatting documents with floats; A new algorithm
This paper describes an approach to placement of floats in multicolumn documents. The current version of LTEX was originally written for single-column documents and extended to support twocolumn documents by essentially building each column independently from the other. As a result the current system shows severe limitations in two column mode, such as the fact that spanning floats are always d...
متن کاملArabic Formatting
SUMMARY This paper describes an Arabic formatting system that is able to format multilingual scientific documents, containing text in Arabic or Persian, as well as other languages, plus pictures, graphs, formulae, tables, bibliographical citations, and bibliographies. The system is an extension of ditroff/ffortid that is already capable of handling Hebrew in the context of multilingual scientif...
متن کاملGenetic algorithm-based optimization of hydrophobicity tables
SUMMARY The genomic abundance and pharmacological importance of membrane proteins have fueled efforts to identify them based solely on sequence information. Previous methods based on the physicochemical principle of a sliding window of hydrophobicity (hydropathy analysis) have been replaced by approaches based on hidden Markov models or neural networks which prevail due to their probabilistic o...
متن کاملAn approximation algorithm for counting contingency tables
We present a randomized approximation algorithm for counting contingency tables, m × n non-negative integer matrices with given row sums R = (r1, . . . , rm) and column sums C = (c1, . . . , cn). We define smooth margins (R,C) in terms of the typical table and prove that for such margins the algorithm has quasi-polynomial NO(lnN) complexity, where N = r1 + · · · + rm = c1 + · · · + cn. Various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1997
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00106-4